Extensions of Sperner and Tucker's lemma for manifolds
نویسنده
چکیده
The Sperner and Tucker lemmas are combinatorial analogous of the Brouwer and Borsuk Ulam theorems with many useful applications. These classic lemmas are concerning labellings of triangulated discs and spheres. In this paper we show that discs and spheres can be substituted by large classes of manifolds with or without boundary.
منابع مشابه
C. 3i Working Paper Alfred P. Sloan School of Management a Unified Approach to Some Combinatorial Lemmas in Topology a Unified Approach to Some Combinatorial Lemmas in Topology
Part II of this study uses the path-following theory of labelled V-complexes developed in Part I to provide constructive algorithmic proofs of a variety of combinatorial lenmas in topology. \Je demonstrate two new dual lemmas on the n-dimensional cube, and use a Generc.lized S ^erner Lemma to prove a gener lization of the Knaster-Kuratowski-y.azurkiewicz Covering Lemma on the simplex. We also s...
متن کاملA Geometric Approach to Combinatorial Fixed-Point Theorems
We develop a geometric framework that unifies several different combinatorial fixed-point theorems related to Tucker’s lemma and Sperner’s lemma, showing them to be different geometric manifestations of the same topological phenomena. In doing so, we obtain (1) new Tucker-like and Sperner-like fixed-point theorems involving an exponential-sized label set; (2) a generalization of Fan’s parity pr...
متن کاملOn the complexity of Sperner’s Lemma
We present several results on the complexity of various forms of Sperner’s Lemma. In the black-box model of computing, we exhibit a deterministic algorithm for Sperner problems over pseudo-manifolds of arbitrary dimension. The query complexity of our algorithm is essentially linear in the separation number of the skeleton graph of the manifold and the size of its boundary. As a corollary we get...
متن کاملA Combinatorial Proof of Kneser's Conjecture
Kneser's conjecture, rst proved by Lovv asz in 1978, states that the graph with all k-element subsets of f1; 2; : : : ; ng as vertices and with edges connecting disjoint sets has chromatic number n ? 2k + 2. We derive this result from Tucker's combinatorial lemma on labeling the vertices of special triangulations of the octahedral ball. By specializing a proof of Tucker's lemma, we obtain self-...
متن کاملA constructive proof of Ky Fan's generalization of Tucker's lemma
We present a constructive proof of Ky Fan’s combinatorial lemma concerning labellings of triangulated spheres. Our construction works for triangulations of Sn that contain a flag of hemispheres. As a consequence, we produce a constructive proof of Tucker’s lemma that holds for a larger class of triangulations than previous constructive proofs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 132 شماره
صفحات -
تاریخ انتشار 2015